Planning High-Quality Grasps Using Mean Curvature Object Skeletons
نویسندگان
چکیده
منابع مشابه
Mean Curvature Skeletons
Inspired by recent developments in contraction-based curve skeleton extraction, we formulate the skeletonization problem via mean curvature flow (MCF). While the classical application of MCF is surface fairing, we take advantage of its area-minimizing characteristic to drive the curvature flow towards the extreme so as to collapse the input mesh geometry and obtain a skeletal structure. By anal...
متن کاملForce Closure Grasps of High Quality
We study grasps of multiinger dexterous hands under the point contact model. Speciically, we are interested in high-quality force closure grasps. We abstract the problem into the space of force/torque wrenches where the quality is proportional to the magnitude of the largest wrench expressed as a non-negative combination of the grasp wrenches. This abstraction enables us to solve the problem by...
متن کاملPlanning optimal grasps
In this paper we will address the problem of planning optimal grasps. Two general optimality criteria, that consider the total finger force and the maximum finger force will be introduced and discussed. Moreover their formalization, using various metrics on a space of generalized forces, will be detailed. The geometric interpretation of the two criteria will lead to an efficient planning algori...
متن کاملImage denoising using mean curvature ∗
We propose a new variational model for image denoising, which employs mean curvature information of the image surface (x, f(x)) induced by the given image f : Ω → R. Besides removing noise efficiently and preserving edges of objects, our method can also keep corners of objects as well as grey-scale intensity contrasts of images. We also compare our model with the classical ROF model [18].
متن کاملCurvature-Based Computation of Antipodal Grasps
It is well known that antipodal grasps can be achieved on curved objects in the presence of friction. This paper presents an efficient algorithm that finds, up to numerical resolution, all pairs of antipodal points on a closed, simple, and twice continuously differentiable plane curve. Dissecting the curve into segments everywhere convex or everywhere concave, the algorithm marches simultaneous...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Robotics and Automation Letters
سال: 2018
ISSN: 2377-3766,2377-3774
DOI: 10.1109/lra.2018.2792694